Free Incomplete Tambara Functors are Almost Never Flat
نویسندگان
چکیده
Abstract Free algebras are always free as modules over the base ring in classical algebra. In equivariant algebra, incomplete Tambara functors play role of and Mackey modules. Surprisingly, often fail to be functors. this paper, we determine for all finite groups conditions under which a functor is functor. For solvable groups, show that flat precisely when these hold. Our results imply almost never However, after suitable localizations,
منابع مشابه
Incomplete Tambara Functors
For a “genuine” equivariant commutative ring spectrum R, π0(R) admits a rich algebraic structure known as a Tambara functor. This algebraic structure mirrors the structure on R arising from the existence of multiplicative norm maps. Motivated by the surprising fact that Bousfield localization can destroy some of the norm maps, in previous work we studied equivariant commutative ring structures ...
متن کاملAlmost Flat Manifolds
1.1. We denote by V a connected ^-dimensional complete Riemannian manifold, by d = d(V) the diameter of V, and by c = c(V) and c~ = c~(V), respectively, the upper and lower bounds of the sectional curvature of V. We set c = c(V) = max (| c1, | c~ |). We say that F i s ε-flat, ε > 0, if cd < ε. 1.2. Examples. a. Every compact flat manifold is ε-flat for any ε > 0. b. Every compact nil-manifold p...
متن کاملConditionally flat functors on spaces and groups
Consider a fibration sequence F → E → B of topological spaces which is preserved as such by some functor L, so that LF → LE → LB is again a fibration sequence. Pull the fibration back along an arbitrary map X → B into the base space. Does the pullback fibration enjoy the same property? For most functors this is not to be expected, and we concentrate mostly on homotopical localization functors. ...
متن کاملFree Applicative Functors
Applicative functors [6] are a generalisation of monads. Both allow the expression of effectful computations into an otherwise pure language, like Haskell [5]. Applicative functors are to be preferred to monads when the structure of a computation is fixed a priori. That makes it possible to perform certain kinds of static analysis on applicative values. We define a notion of free applicative fu...
متن کاملFlat counter automata almost everywhere!
This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be “replaced”, equivalently w.r.t. reachability, by another one with no nested loops. From a practical view point, we show that flatness is a necessary and sufficient condition for termination of accelerated symbolic model checking, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Mathematics Research Notices
سال: 2022
ISSN: ['1687-0247', '1073-7928']
DOI: https://doi.org/10.1093/imrn/rnab361